Case Studies in Algorithms
Back to Home
01. Case Study Introduction
02. Shortest Path Problem
03. Dijkstra's Algorithm
04. Knapsack Problem
05. A Faster Algorithm
06. Dynamic Programming
07. Traveling Salesman Problem
08. Exact and Approximate Algorithms
Back to Home
08. Exact and Approximate Algorithms
Exact and Approximate Algorithms
Pause
Play
% buffered
00:00
00:00
Unmute
Mute
Disable captions
Enable captions
Settings
Captions
Disabled
Quality
undefined
Speed
Normal
Captions
Go back to previous menu
Disabled
US
US
en
EN
JP
JP
BR
BR
CN
CN
Quality
Go back to previous menu
Speed
Go back to previous menu
0.5×
0.75×
Normal
1.25×
1.5×
1.75×
2×
Exit fullscreen
Enter fullscreen
Play